Watertight and 2-Manifold Surface Meshes Using Dual Contouring With Tetrahedral Decomposition of Grid Cubes
نویسندگان
چکیده
The Dual Contouring algorithm (DC) is a grid-based process used to generate surface meshes from volumetric data. The advantage of DC is that it can reproduce sharp features by inserting vertices anywhere inside the grid cube, as opposed to the Marching Cubes (MC) algorithm that can insert vertices only on the grid edges. However, DC is unable to guarantee 2-manifold and watertight meshes due to the fact that it produces only one vertex for each grid cube. We present a modified Dual Contouring algorithm that is capable of overcoming this limitation. Our method decomposes an ambiguous grid cube into a maximum of twelve tetrahedral cells; we introduce novel polygon generation rules that produce 2-manifold and watertight surface meshes. We have applied our proposed method on realistic data, and a comparison of the results of our proposed method with results from traditional DC shows the effectiveness of our method. © 2016 The Authors. Published by Elsevier Ltd. Peer-review under responsibility of the organizing committee of IMR 25.
منابع مشابه
Adaptive Multiresolution and Quality 3D Meshing from Imaging Data
This paper presents an algorithm to extract adaptive and quality 3D meshes directly from volumetric imaging data primarily Computed Tomography (CT) and Magnetic Resonance Imaging (MRI). The extracted tetrahedral and hexahedral meshes are extensively used in the Finite Element Method (FEM). Our comprehensive approach combines bilateral and anisotropic (feature specific) diffusion filtering, with...
متن کاملWatertight Planar Surface Reconstruction of Voxel Data
There are many scenarios where a 3D shape is represented by a voxel occupancy grid. Oftentimes it is desirable to convert data from this format to a triangulated mesh that represents the surface of the volume described by the occupied voxels. Algorithms such as Marching Cubes [8] or Dual Contouring [6] can be applied, or each square voxel face could be converted to two triangles directly [9]. U...
متن کاملConstruction of Hexahedral Block Topology and its Decomposition to Generate Initial Tetrahedral Grids for Aerodynamic Applications
Making an initial tetrahedral grid for complex geometry can be a tedious and time consuming task. This paper describes a novel procedure for generation of starting tetrahedral cells using hexahedral block topology. Hexahedral blocks are arranged around an aerodynamic body to form a flow domain. Each of the hexahedral blocks is then decomposed into six tetrahedral elements to obtain an initial t...
متن کاملComparing Techniques for Tetrahedral Mesh Generation
The growing importance of subject-specific modeling and simulation in medical applications has increased the need for automatic techniques for creating high-quality meshes directly from medical data. We discuss the main aspects related to volumetric mesh generation from iso-surfaces. We take a practical approach, and the main focus of this paper is evaluating processing pipelines using widely a...
متن کاملQuadtree and Octree Grid Generation
Engineering analysis often involves the accurate numerical solution of boundary value problems in discrete form. Hierarchical quadtree (or octree) grid generation offers an efficient method for the spatial discretisation of arbitrary-shaped two- (or three-) dimensional domains. It consists of recursive algebraic splitting of sub-domains into quadrants (or cubes), leading to an ordered hierarchi...
متن کامل